Post-Quantum Multi-Party Computation

We initiate the study of multi-party computation for classical functionalities in plain model, with security against malicious quantum adversaries. observe that existing techniques readily give a polynomial-round protocol, but our main result is construction constant-round post-quantum computation. assume mildly super-polynomial hardness learning errors (LWE), and polynomial an LWE-based circular assumption. Along way, we develop following cryptographic primitives may be independent interest: To prove new straight-line non-black-box simulation technique parallel sessions does not clone adversary’s state. This also relevant to setting.